package JZ39_平衡二叉树;

import org.jcp.xml.dsig.internal.dom.DOMSubTreeData;

class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

    public TreeNode(int val) {
        this.val = val;
    }

}

public class Solution {
    public int TreeDepth(TreeNode root) {
        if (root == null){
            return 0;
        }
        int nleft = TreeDepth(root.left);
        int nright = TreeDepth(root.right);

        return nleft > nright ? (nleft + 1) : (nright + 1);
    }
    public boolean IsBalanced_Solution(TreeNode root) {
        if (root == null){
            return true;
        }
        int left = TreeDepth(root.left);
        int right = TreeDepth(root.right);
        int dif = left - right;

        if (dif > 1 || dif < - 1){
            return false;
        }
        return IsBalanced_Solution(root.left) && IsBalanced_Solution(root.right);
    }
}
